Labellings and Games for Extended Argumentation Frameworks

نویسنده

  • Sanjay Modgil
چکیده

Dung’s abstract theory of argumentation has become established as a general framework for various species of non-monotonic reasoning, and reasoning in the presence of conflict. A Dung framework consists of arguments related by attacks, and the extensions of a framework, and so the status of arguments, are defined under different semantics. Developments of Dung’s work have also defined argument labellings as an alternative way of characterising extensions, and dialectical argument game proof theories for establishing the status of individual arguments. Recently, Extended Argumentation Frameworks extend Dung’s theory so that arguments not only attack arguments, but attacks themselves. In this way, the extended theory provides an abstract framework for principled integration of meta-level argumentation about defeasible preferences applied to resolve conflicts between object level arguments. In this paper we formalise labellings and argument games for a selection of Dung’s semantics defined for the extended frameworks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation

This paper presents a meta-algorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCC-Recursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted sub-frameworks, in order to reduce the computational effort. The meta-algorithm can be instantiated with a specific “base ...

متن کامل

An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation

This paper presents a meta-algorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCC-Recursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted sub-frameworks, in order to reduce the computational effort. The meta-algorithm can be instantiated with a specific “base ...

متن کامل

Integrating Object and Meta-Level Value Based Argumentation

A recent extension to Dung’s argumentation framework allows for arguments to express preferences between other arguments. Value based argumentation can be formalised in this extended framework, enabling meta-level argumentation about the values that arguments promote, and the orderings on these values. In this paper, we show how extended frameworks integrating meta-level reasoning about values ...

متن کامل

Probabilistic abstract argumentation: an investigation with Boltzmann machines

Probabilistic argumentation and neuro-argumentative systems offer new computational perspectives for the theory and applications of argumentation, but their principled construction involve two entangled problems. On the one hand, probabilistic argumentation aims at combining the quantitative uncertainty addressed by probability theory with the qualitative uncertainty of argumentation, but proba...

متن کامل

ZJU-ARG: A Decomposition-Based Solver for Abstract Argumentation

Argumentation Qianle Guo and Beishui Liao 1 Center for the Study of Language and Cognition, Zhejiang University, Hangzhou 310028, P.R.China 2 University of Luxembourg, Luxembourg Abstract. This paper gives the system description of a solver for abstract argumentation ZJU-ARG submitted to the First International Competition on Computational Models of Argumentation (ICCMA’15). It adopts a decompo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009